github.com/andybalholm/brotli.blockEncoder.bits_ (field)

20 uses

	github.com/andybalholm/brotli (current package)
		brotli_bit_stream.go#L1009: 	bits_             []uint16
		brotli_bit_stream.go#L1021: 		self.bits_ = self.bits_[:0]
		brotli_bit_stream.go#L1073: 		writeBits(uint(self.depths_[ix]), uint64(self.bits_[ix]), storage_ix, storage)
		brotli_bit_stream.go#L1098: 		writeBits(uint(self.depths_[ix]), uint64(self.bits_[ix]), storage_ix, storage)
		brotli_bit_stream.go#L1109: 	if cap(self.bits_) < int(table_size) {
		brotli_bit_stream.go#L1110: 		self.bits_ = make([]uint16, table_size)
		brotli_bit_stream.go#L1112: 		self.bits_ = self.bits_[:table_size]
		brotli_bit_stream.go#L1118: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)
		brotli_bit_stream.go#L1130: 	if cap(self.bits_) < int(table_size) {
		brotli_bit_stream.go#L1131: 		self.bits_ = make([]uint16, table_size)
		brotli_bit_stream.go#L1133: 		self.bits_ = self.bits_[:table_size]
		brotli_bit_stream.go#L1139: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)
		brotli_bit_stream.go#L1151: 	if cap(self.bits_) < int(table_size) {
		brotli_bit_stream.go#L1152: 		self.bits_ = make([]uint16, table_size)
		brotli_bit_stream.go#L1154: 		self.bits_ = self.bits_[:table_size]
		brotli_bit_stream.go#L1160: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)